منابع مشابه
Monotone partitions and almost partitions
Article history: Received 28 April 2014 Received in revised form 14 October 2014 Accepted 14 October 2014 Available online 31 October 2014 MSC: 54D20
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملPath partitions of almost regular graphs
The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider upper bounds on the path partition number under minimum and maximum degree assumptions.
متن کاملEquitable Partitions and Orbit Partitions
We consider two kinds of partition of a graph, namely orbit partitions and equitable partitions. Although an orbit partition is always an equitable partition, the converse is not true in general. We look at some classes of graphs for which the converse is true.
متن کاملLaplacian eigenvectors and eigenvalues and almost equitable partitions
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. c © 2006 Elsevier Ltd. All rights rese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2014
ISSN: 0166-8641
DOI: 10.1016/j.topol.2014.10.012